Iterative Schemes Involving Several Mutual Contractions
نویسندگان
چکیده
In this paper, we introduce the new concept of mutual Reich contraction that involves a pair operators acting on distance space. We chose framework strong b-metric spaces (generalizing standard metric spaces) in order to add more extended underlying structure. provide sufficient conditions for two mutually contractive maps have common fixed point. The result is family any cardinality. dynamics iterative discrete systems involving type self-maps studied. case normed spaces, establish some relations between contractivity and classical linear operators. Then, functional generalizes Banach contraction, perform similar study case. also contractions quasinormed mappings. Lastly, apply obtained results convolutional had been defined by first author Bochner integrable Banach-valued curves.
منابع مشابه
Annealing of Iterative Stochastic Schemes
Annealing of general iterative stochastic schemes is studied by using Wentzell’s large deviation theory. The convergence of this algorithm is shown under some conditions. The closed form of the critical constant is specified in terms of its potential function of the mean model.
متن کاملSeveral Series Identities Involving the Catalan Numbers
In the paper, the authors discover several series identities involving the Catalan numbers, the Catalan function, the Riemanian zeta function, and the alternative Hurwitz zeta function.
متن کاملMulti-Predicate Induction Schemes for Mutual Recursion
Where mutually recursive data types are used in programming languages, etc., mutually recursive functions are usually required. Mutually recursive functions are also quite common for non-mutually recursive types. Reasoning about recursive functions requires some form of mathematical induction but there have been difficulties in adapting induction methods for simple recursion to the mutually rec...
متن کاملConvergence rate analysis of several splitting schemes
Splitting schemes are a class of powerful algorithms that solve complicated monotone inclusions and convex optimization problems that are built from many simpler pieces. They give rise to algorithms in which the simple pieces of the decomposition are processed individually. This leads to easily implementable and highly parallelizable algorithms, which often obtain nearly state-of-the-art perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11092019